Escrowed Deniable Identification Schemes

نویسندگان

  • Pairat Thorncharoensri
  • Qiong Huang
  • Willy Susilo
  • Man Ho Au
  • Yi Mu
  • Duncan S. Wong
چکیده

Generally, the goal of identification schemes is to provide security assurance against impersonation attacks. Identification schemes based on zero knowledge protocols have more advantages, for example, deniability, which enables the prover to deny an identification proof so that the verifier couldn’t persuade others that it is indeed the prover who identified itself to him. This kind of identifications is called ‘deniable identification’. However, in some applications we require the existence of a (trusted) party being able to find out an evidence that a party did identify itself to a verifier is required, in order to prevent parties from misbehavior. So in this case ‘undeniability’ is needed. To the best of our knowledge, an identification scheme that provides both deniability and undeniability does not exist in the literature. In this work we propose the notion of escrowed deniable identification schemes, which integrates both ‘escrowed deniability’ (undeniability) and ‘deniability’ properties. Intuitively, in the online communication, a verifier may sometimes need to provide an evidence of a conversation between himself and the prover, for instance, an evidence for the case of misuse of the prover’s privilege. We then provide an escrowed deniable identification scheme, and prove its security, i.e. impersonation, deniability and escrowed deniability, in the standard model based on some standard number theoretic assumptions. Disciplines Physical Sciences and Mathematics Publication Details Thorncharoensri, P., Huang, Q., Susilo, W., Au, M. Ho., Mu, Y. & Wong, D. (2010). Escrowed deniable identification schemes. International Journal of Security and Its Applications, 4 (1), 49-67. Authors Pairat Thorncharoensri, Qiong Huang, Willy Susilo, Man Ho Allen Au, Yi Mu, and Duncan Wong This journal article is available at Research Online: http://ro.uow.edu.au/infopapers/3560 Escrowed Deniable Identification Schemes Pairat Thorncharoensri, Qiong Huang, Willy Susilo, Man Ho Au, Yi Mu and Duncan Wong School of Computer Science & Software Engineering, University of Wollongong, Australia Department of Computer Science, City University of Hong Kong, Hong Kong {pt78,wsusilo,mhaa456,ymu}@uow.edu.au, [email protected], [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A non-interactive deniable authentication scheme in the standard model

the standard model Bin Wang ,Qing Zhao and Ke Dai Information Engineering College of Yangzhou University No.196 West HuaYang Road, Yangzhou City, Jiangsu Province, P.R.China E-mail: [email protected] Abstract: Deniable authentication protocols enable a sender to authenticate a message to a receiver such that the receiver is unable to prove the identity of the sender to a third party. In contrast...

متن کامل

Cryptanalysis of an Efficient Deniable Authentication Protocol Based on Generalized ElGamal Signature Scheme

In 1998, Dwork et al. first proposed an application of zeroknowledge, deniable authentication protocol. Thereafter, there were many researches about the deniable authentication schemes. In 2004, Shao demonstrated out that the previous schemes had a common weakness in which any third party can impersonate the intended receiver to verify the signature of the given message, and they proposed a new...

متن کامل

Non-interactive Deniable Ring Authentication

In this paper, we propose a new primitive called non interactive deniable ring authentication: it is possible to convince a verifier that a member of an ad hoc collection of participants is authenticating a message m without revealing which one and the verifier V cannot convince any third party that the message m was indeed authenticated in a non-interactive way. Unlike the deniable ring authen...

متن کامل

A Receiver Deniable Encryption Scheme

A practical efficient receiver deniable encryption scheme based on BCP commitment scheme and idea of Klonowski et al. is proposed in the paper. The analysis of the proposed schemes is also presented.

متن کامل

Deniable Attribute Based Encryption for Branching Programs from LWE

Deniable encryption (Canetti et al. CRYPTO ’97) is an intriguing primitive that provides a security guarantee against not only eavesdropping attacks as required by semantic security, but also stronger coercion attacks performed after the fact. The concept of deniability has later demonstrated useful and powerful in many other contexts, such as leakage resilience, adaptive security of protocols,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009